- substring searching
- Программирование: поиск подстроки
Универсальный англо-русский словарь. Академик.ру. 2011.
substring searching
Смотреть что такое "substring searching" в других словарях:
Substring — A subsequence, substring, prefix or suffix of a string is a subset of the symbols in a string, where the order of the elements is preserved. In this context, the terms string and sequence have the same meaning. Subsequence : Main article… … Wikipedia
Fuzzy string searching — Approximate string search is the name that is used for a category of techniques for finding strings that approximately match some given pattern string. It may also be known as approximate or inexact matching. Approximate string searching has two… … Wikipedia
String searching algorithm — String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be… … Wikipedia
Symbolics Document Examiner — was a powerful and early hypertext system developed at Symbolics (a manufacturer of high end workstations) by Janet Walker in 1985. The Symbolics Document Examiner was first used for a hypertext implementation of the Symbolics manual in the sixth … Wikipedia
Rabin-Karp string search algorithm — The Rabin Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find a substring in a text. It is used for multiple pattern matching rather than single pattern matching. For… … Wikipedia
Text Executive Programming Language — In 1979, Honeywell Information Systems announced a new programming language for their time sharing service named TEX, an acronym for the Text Executive processor. TEX was a first generation scripting language, developed around the time of AWK and … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Scunthorpe Problem — The Scunthorpe Problem occurs when a spam filter or search engine blocks e mails or search results because their text contains a string of letters that are shared by an obscene word. While computers can easily identify strings of text within a… … Wikipedia
Scunthorpe problem — The Scunthorpe problem occurs when a spam filter or search engine blocks e mails or search results because their text contains a string of letters that are shared with an obscene word. While computers can easily identify strings of text within a… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
